2.5D Elastic graph matching

1077-3142/$ see front matter 2011 Elsevier Inc. A doi:10.1016/j.cviu.2010.12.008 ⇑ Corresponding author. E-mail addresses: [email protected] (S imperial.ac.uk (M. Petrou). In this paper, we propose novel elastic graph matching (EGM) algorithms for face recognition assisted by the availability of 3D facial geometry. More specifically, we conceptually extend the EGM algorithm in order to exploit the 3D nature of human facial geometry for face recognition/verification. In order to achieve that, first we extend the matching module of the EGM algorithm in order to capitalize on the 2.5D facial data. Furthermore, we incorporate the 3D geometry into the multiscale analysis used and build a novel geodesic multiscale morphological pyramid of dilations/erosions in order to fill the graph jets. We show that the proposed advances significantly enhance the performance of EGM algorithms. We demonstrate the efficiency of the proposed advances in the face recognition/verification problem using photometric stereo. 2011 Elsevier Inc. All rights reserved.